#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 15;

int n, m;
double a[N][N];
double b[N][N];
int select(int i) {
  int mx = i;
  rep(j, i + 1, n) {
    if (abs(b[j][i]) > abs(b[mx][i])) mx = j;
  }
  return mx;
}
void swap_row(int i, int j) { rep(k, 1, n + 1) swap(b[i][k], b[j][k]); }
void normal(int i) {
  double x = b[i][i];
  rep(j, 1, n + 1) b[i][j] /= x;
}
void sub(int k, int i) {
  if (k == i) return;
  double x = b[k][i];
  rep(j, 1, n + 1) b[k][j] -= x * b[i][j];
}
void gauss() {
  rep(i, 1, n) {
    int j = select(i);
    if (j != i) swap_row(i, j);
    normal(i);
    rep(k, 1, n) sub(k, i);
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  rep(i, 0, n) rep(j, 1, n) cin >> a[i][j];
  // (xi-x0) * x = (xi-x0) * (xi+x0) / 2;
  rep(i, 1, n) {
    rep(j, 1, n) b[i][j] = a[i][j] - a[0][j];
    rep(j, 1, n) b[i][n + 1] += (a[i][j] - a[0][j]) * (a[i][j] + a[0][j]) / 2;
  }
  gauss();
  rep(i, 1, n) cout << fixed << setprecision(3) << b[i][n + 1] << ' ';

  return 0;
}